Characterization and Recognition of Digraphs of Bounded Kelly-width
نویسندگان
چکیده
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of directed graphs of bounded Kelly-width in support of this analogy. We apply these results to give the first polynomial-time algorithm recognizing directed graphs of Kelly-width 2. For an input directed graph G = (V,A) the algorithm will output a vertex ordering and a directed graph H = (V,B) with A ⊆ B witnessing either that G has Kelly-width at most 2 or that G has Kelly-width at least 3, in time linear in H .
منابع مشابه
Directed width parameters and circumference of digraphs
We prove that the directed treewidth, DAG-width and Kelly-width of a digraph are bounded above by its circumference plus one.
متن کاملDigraphs of bounded elimination width
Hunter and Kreutzer recently introduced the digraph width measure Kelly-width. The measure is based on a vertex elimination process that aims at bounding the out-degree of a vertex during the elimination. We refine the Kelly-width measure by bounding both the out-degree and the in-degree of a vertex. We show that the elimination process and a subgraph characterisation of Kelly-width naturally g...
متن کاملOn the complexity of the multicut problem in bounded tree-width graphs and digraphs
Given an edgeor vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NPhard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pai...
متن کاملThe Parameterized Complexity of Oriented Colouring
The oriented colouring problem is intuitive and related to undirected colouring, yet remains NP-hard even on digraph classes with bounded traditional directed width measures. Recently we have also proved that it remains NP-hard in otherwise severely restricted digraph classes. However, unlike most other problems on directed graphs, the oriented colouring problem is not directly transferable to ...
متن کاملChordal Digraphs
Chordal graphs, also called triangulated graphs, are important in algorithmic graph theory. In this paper we generalise the definition of chordal graphs to the class of directed graphs. Several structural properties of chordal graphs that are crucial for algorithmic applications carry over to the directed setting, including notions like simplicial vertices, perfect elimination orderings, and ch...
متن کامل